A Multiconstraint Qos Routing Scheme Using a Modified Dijkstra’s Algorithm

Multiconstraint QoS (quality of service) routing is an essential mechanism to support computer/communication applications that have requirements on various QoS attributes. The multiconstraint QoS routing problem involves finding a feasible path, i.e., a path satisfying a given set of QoS constraints between given source and destination nodes. Unfortunately, the multiconstraint QoS routing problem is known to be NP-complete [1]. Hence, several heuristic schemes have been proposed for its solution. Typical performance measures for such schemes are time complexity and erroneous decision rate (EDR). EDR is defined as the fraction of instances that a routing scheme either fails to find a feasible path that exists, or finds a path that turns out to be infeasible. Low time complexity and low EDR are the goal of multiconstraint QoS routing schemes. In this paper, we propose a multiconstraint QoS routing scheme, called MPMP (multi-prepaths multi-postpaths). MPMP searches for a feasible path